A Dynamic Active-Set Method for Linear Programming
نویسندگان
چکیده
منابع مشابه
A Combinatorial Active Set Algorithm for Linear and Quadratic Programming
We propose an algorithm for linear programming, which we call the Sequential Projection algorithm. This new approach is a primal improvement algorithm that keeps both a feasible point and an active set, which uniquely define an improving direction. Like the simplex method, the complexity of this algorithm need not depend explicitly on the size of the numbers of the problem instance. Unlike the ...
متن کاملA Primal-Dual Active-Set Method for Convex Quadratic Programming
The paper deals with a method for solving general convex quadratic programming problems with equality and inequality constraints. The interest in such problems comes from at least two facts. First, quadratic models are widely used in real-life applications. Second, in many algorithms for nonlinear programming, a search direction is determined at each iteration as a solution of a quadratic probl...
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملDefuzzification Method for Solving Fuzzy Linear Programming Problems
Several authors have proposed different methods to find the solution of fully fuzzy linear programming (FFLP) problems. But all the existing methods are based on the assumption that all the fuzzy coefficients and the fuzzy variables are non-negative fuzzy numbers. in this paper a new method is proposed to solve an FFLP problems with arbitrary fuzzy coefficients and arbitrary fuzzy variables, th...
متن کاملAn Active Set Algorithm for Nonlinear Programming Using Linear Programming and Equality Constrained Subproblems
This paper describes an active set algorithm for large scale nonlinear programming based on the successive linear programming method proposed by Fletcher and Sainz de la Maza The step computation is performed in two stages In the rst stage a linear program is solved to estimate the active set at the solution The linear program is obtained by making a linear approximation to the penalty function...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2015
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2015.56041